A Fluent Calculus Semantics for ADL with Plan Constraints
نویسندگان
چکیده
Plan constraints are the most recent addition to the ever growing Planning Domain Definition Language (PDDL). In this work we consider the PDDL fragment consisting of basic ADL extended by plan constraints. We provide a purely declarative semantics for this fragment by interpreting it in the basic Fluent Calculus. We thus obtain a logical semantics for this fragment of PDDL instead of the usual meta-theoretical state transition semantics.
منابع مشابه
The Features-and-Fluents Semantics for the Fluent Calculus
Based on an elaborate ontological taxonomy, the Featuresand-Fluents framework provides an independent action semantics for assessing the range of applicability of action calculi. In this paper, we show how the fluent calculus can be used to capture the full range of phenomena in K-IA, the broadest ontological class that has been fully formalized in (Sandewall 1994). To this end, we develop a si...
متن کاملProof System for Plan Verification under 0-Approximation Semantics
In this paper a proof system is developed for plan verification problems {X}c{Y } and {X}c{KWp} under 0-approximation semantics for AK . Here, for a plan c, two sets X,Y of fluent literals, and a literal p, {X}c{Y } (resp. {X}c{KWp}) means that all literals of Y become true (resp. p becomes known) after executing c in any initial state in which all literals in X are true. Then, soundness and co...
متن کاملReasoning about Actions with CHRs and Finite Domain Constraints
We present a CLP-based approach to reasoning about actions in the presence of incomplete states. Constraints expressing negative and disjunctive state knowledge are processed by a set of special Constraint Handling Rules. In turn, these rules reduce to standard finite domain constraints when handling variable arguments of single state components. Correctness of the approach is proved against th...
متن کاملTowards an Integration of Golog and Planning
The action language Golog has been applied successfully to the control of robots, among other things. Perhaps its greatest advantage is that a user can write programs which constrain the search for an executable plan in a flexible manner. However, when general planning is needed, Golog supports this only in principle, but does not measure up with state-of-the-art planners. In this paper we prop...
متن کاملFeature & Fluent revisited: from Event Calculus to Fluent Logic Programming
In this paper, we make use of a meta-logical representation based on the Kowalski and Sergot's Event Calculus in order to integrate the discrete uent logic (DFL) proposed in Features & Fluents by Erik Sandewall, into a logic programming (LP) setting. As result of this attempt we obtain an extended LP-based language that we call Fluent Logic Programming (FLP). Completeness result are shown with ...
متن کامل